On Adaptive Integer Sorting
نویسندگان
چکیده
Abstract. This paper considers integer sorting on a RAM. We show This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys, and a total of n keys. Using the recent O(n √ log logn) expected time sorting of Han and Thorup on each set, we immediately get an adaptive expected sorting time of O(n √ log log q). Interestingly, for any positive constant ε, we show that multisorting and adaptive inversion sorting can be performed in linear time if q ≤ 2 n) 1−ε . We also show how to asymptotically improve the running time of any traditional sorting algorithm on a class of inputs much broader than those with few inversions.
منابع مشابه
Integer-order Versus Fractional-order Adaptive Fuzzy Control of Electrically Driven Robots with Elastic Joints
Real-time robust adaptive fuzzy fractional-order control of electrically driven flexible-joint robots has been addressed in this paper. Two important practical situations have been considered: the fact that robot actuators have limited voltage, and the fact that current signals are contaminated with noise. Through of a novel voltage-based fractional order control for an integer-order dynamical ...
متن کاملLRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a previous block. They were used to encode ordinal trees and to index integer arrays in order to support range minimum queries on them. We describe how they yield many other convenient results in a variety of areas: compres...
متن کاملSolving a location-allocation problem by a fuzzy self-adaptive NSGA-II
This paper proposes a modified non-dominated sorting genetic algorithm (NSGA-II) for a bi-objective location-allocation model. The purpose is to define the best places and capacity of the distribution centers as well as to allocate consumers, in such a way that uncertain consumers demands are satisfied. The objectives of the mixed-integer non-linear programming (MINLP) model are to (1) minimize...
متن کاملInteger Sorting and Routing in Arrays with Reconfigurable Optical Buses
In this paper we present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconngurable optical buses. The main objective is to identify the mechanisms speciic to this type of architectures that allow us to build eecient integer sorting, partial permutation routing and h-relations algorithms. The consequences of these results on the PRAM simulation complexi...
متن کامل